Location of Non-Zeros in Sparse Solutions of Underdetermined Linear Systems of Equations
نویسنده
چکیده
The problem of computing sparse (mostly zero) or sparsifiable (by linear transformation) solutions to greatly underdetermined linear systems of equations has applications in compressed sensing. The locations of the nonzero elements in the solution is a much smaller set of variables than the solution itself. We present explicit equations for the relatively few variables that determine these nonzero locations and also propose an iterative algorithm for their solution. Keywords— Sparse reconstruction Phone: 734-763-9810. Fax: 734-763-1503. Email: [email protected]. EDICS: 2-REST.
منابع مشابه
Non-Iterative Computation of Sparsifiable Solutions to Underdetermined Kronecker Product Linear Systems of Equations
The problem of computing sparse (mostly zero) or sparsifiable (by linear transformation) solutions to underdetermined linear systems of equations has applications in compressed sensing and minimumexposure medical imaging. We present a simple, noniterative, low-computational-cost algorithm for computing a sparse solution to an underdetermined linear system of equations. The system matrix is the ...
متن کاملA Non-Iterative Procedure for Computing Sparse and Sparsifiable Solutions to Slightly Underdetermined Linear Systems of Equations
The problem of computing sparse (mostly zero) solutions to underdetermined linear systems of equations has received much attention recently, due to its applications to compressed sensing. Under mild assumptions, the sparsest solution has minimum-L1norm, and can be computed using linear programming. In some applications (valid deconvolution, singular linear transformations), the linear system is...
متن کاملSparse Solutions of Systems of Equations and Sparse Modelling of Signals and Images
In this project we are interested in finding sparse solutions to systems of linear equations Ax = b, where A is underdetermined and fully-ranked, as presented in [1]. In particular, we are interested in the application of this problem to signal compression. We examine the implementation of the orthogonal matching pursuit algorithm and explore its application to the above problem.
متن کاملA fast approach for overcomplete sparse decomposition based on smoothed ` 0 norm
In this paper, a fast algorithm for overcomplete sparse decomposition, called SL0, is proposed. The algorithm is essentially a method for obtaining sparse solutions of underdetermined systems of linear equations, and its applications include underdetermined Sparse Component Analysis (SCA), atomic decomposition on overcomplete dictionaries, compressed sensing, and decoding real £eld codes. Contr...
متن کاملA fast approach for overcomplete sparse decomposition based on smoothed l norm
In this paper, a fast algorithm for overcomplete sparse decomposition, called SL0, is proposed. The algorithm is essentially a method for obtaining sparse solutions of underdetermined systems of linear equations, and its applications include underdetermined Sparse Component Analysis (SCA), atomic decomposition on overcomplete dictionaries, compressed sensing, and decoding real field codes. Cont...
متن کامل